On the Borel Complexity of MSO Definable Sets of Branches
نویسندگان
چکیده
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow some extra monadic predicates on the nodes. We show that this class equals to the Boolean combinations of sets in the Borel class Σ 2 over the Cantor discontinuum. Note that the last coincides with the Borel complexity of ω-regular languages.
منابع مشابه
On the Topological Complexity of MSO+U and Related Automata Models
We show that Monadic Second Order Logic on ω-words extended with the unbounding quantifier (MSO+U) can define non-Borel sets. We conclude that there is no model of nondeterministic automata with a Borel acceptance condition which captures all of MSO+U. We also give an exact topological complexity of the classes of languages recognized by nondeterministic ωB-, ωSand ωBS-automata studied by Bojań...
متن کاملParameterized Shifted Combinatorial Optimization
Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well studied and diverse problems ranging from so-called vulnerability problems to sharing and partitioning problems. In particular, every standard combinatorial optim...
متن کاملThe Topological Complexity of MSO+U and Related Automata Models
This work shows that for each i ∈ ω there exists a Σi -hard ω-word language definable in Monadic Second Order Logic extended with the unbounding quantifier (MSO + U). This quantifier was introduced by Bojańczyk to express some asymptotic properties. Since it is not hard to see that each language expressible in MSO + U is projective, our finding solves the topological complexity of MSO + U. The ...
متن کاملCountable Borel Equivalence Relations
This paper is a contribution to a new direction in descriptive set theory that is being extensively pursued over the last decade or so. It deals with the development of the theory of definable actions of Polish groups, the structure and classification of their orbit spaces, and the closely related study of definable equivalence relations. This study is motivated by basic foundational questions,...
متن کاملOn Matroid Properties Definable in the MSO Logic
It has been proved by the author that all matroid properties definable in the monadic second-order (MSO) logic can be recognized in polynomial time for matroids of bounded branch-width which are represented by matrices over finite fields. (This result extends so called “MS2-theorem” of graphs by Courcelle and others.) In this work we review the MSO theory of finite matroids and show some intere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 98 شماره
صفحات -
تاریخ انتشار 2010